Decentralized subcontractor scheduling with divisible jobs
نویسندگان
چکیده
منابع مشابه
Decentralized subcontractor scheduling with divisible jobs
Subcontracting allows manufacturer agents to reduce completion times of their jobs and thus obtain savings. This paper addresses the coordination of decentralized scheduling systems with a single subcontractor and several agents having divisible jobs. Assuming complete information, we design parametric pricing schemes that strongly coordinate this decentralized system, i.e., the agents’ choices...
متن کاملScheduling with Incompatible Jobs
We consider scheduling problems in a multiprocessor system with incompatible jobs (two incompatible jobs cannot be processed by the same machine). We consider the problem to minimize the maximum job completion time. the makespan. This problem is NP-complete. We present a number of polynomial time approximation algorithms for this problem where the job incompatibilities possess a special structu...
متن کاملSingle Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...
متن کاملScheduling Adaptively Parallel Jobs Scheduling Adaptively Parallel Jobs
An adaptively parallel job is one in which the number of processors which can be used without waste changes during execution. When allocating processors to multiple adap-tively parallel jobs, a job scheduler should attempt to be fair|meaning that no job gets fewer processors than another, unless it demands fewer|and eecient|meaning that the scheduler does not waste processors on jobs that do no...
متن کاملScheduling jobs with chain precedence constraints and deteriorating jobs
In this paper we consider a single machine scheduling problem with deteriorating jobs. By deteriorating jobs, we mean that the processing time of a job is a simple linear function of its execution starting time. For the jobs with chain precedence constraints, we prove that the weighted sum of squared completion times minimization problem with strong chains and weak chains can be solved in polyn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scheduling
سال: 2015
ISSN: 1094-6136,1099-1425
DOI: 10.1007/s10951-015-0432-2